Dynamic Limit Growth Indices in Discrete Time

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Limit Growth Indices in Discrete Time

We propose a new class of mappings, called Dynamic Limit Growth Indices, that are designed to measure the long-run performance of a nancial portfolio in discrete time setup. We study various important properties for this new class of measures, and in particular, we provide necessary and su cient condition for a Dynamic Limit Growth Index to be a dynamic assessment index. We also establish their...

متن کامل

Limit theorems for discrete-time metapopulation models

We describe a class of one-dimensional chain binomial models of use in studying metapopulations (population networks). Limit theorems are established for time-inhomogeneous Markov chains that share the salient features of these models. We prove a law of large numbers, which can be used to identify an approximating deterministic trajectory, and a central limit theorem, which establishes that the...

متن کامل

Discrete kinetic models in the fluid dynamic limit

We investigate discrete kinetic models in the Fluid dynamic limit described by the Euler system and the Navier-Stokes correction obtained by the Chapman Enskog procedure. We show why reliable “small” systems can be expected only for small Mach numbers and derive a calculus for designing models for given Prandtl numbers.

متن کامل

Limit Theorems for Height Fluctuations in a Class of Discrete Space and Time Growth Models

We introduce a class of one-dimensional discrete space-discrete time stochastic growth models described by a height function ht(x) with corner initialization. We prove, with one exception, that the limiting distribution function of ht(x) (suitably centered and normalized) equals a Fredholm determinant previously encountered in random matrix theory. In particular, in the universal regime of larg...

متن کامل

Discrete-time dynamic average consensus

Wepropose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely on the input-to-output stability properties of static average consensus algorithms and require that the union of communication graphs over a bounded period of time be strongly connected. The only requirement on the set ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Models

سال: 2015

ISSN: 1532-6349,1532-4214

DOI: 10.1080/15326349.2015.1053616